Computability logic

Results: 552



#Item
191Lambda calculus / Theory of computation / Computability theory / Functions and mappings / Logic in computer science / Combinatory logic / Function / Primitive recursive function / De Bruijn index / Mathematics / Theoretical computer science / Mathematical logic

LFMTPNominal Reasoning Techniques in Coq (Extended Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science

Add to Reading List

Source URL: www.seas.upenn.edu

Language: English - Date: 2014-07-10 05:49:28
192Computability theory / Theory of computation / Lambda calculus / Logic in computer science / Decision problem / Combinatory logic / Profinite group / Computability / Henk Barendregt / Theoretical computer science / Mathematical logic / Mathematics

The Ackermann Award 2012 Thierry Coquand1 , Anuj Dawar2 , and Damian Niwiński3 1,2,3 Members of EACSL Jury of the Ackermann Award∗

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2012-08-27 10:54:53
193Models of computation / Computability theory / Lambda calculus / Function / Mathematics / Mathematical logic / Theoretical computer science

Irrelevance, Heterogeneous Equality, and Call-by-value Dependent Type Systems Vilhelm Sj¨oberg Chris Casinghino

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2014-07-10 05:47:12
194Theoretical computer science / Lambda calculus / Computability theory / Evaluation strategy / Calculus / Free variables and bound variables / Function / Parameter / Algorithm / Mathematics / Mathematical logic / Applied mathematics

The Call-by-need Lambda Calculus, Revisited Stephen Chang and Matthias Felleisen College of Computer Science Northeastern University Boston, Massachusetts, USA { stchang | matthias } @ ccs.neu.edu

Add to Reading List

Source URL: www.ccs.neu.edu

Language: English - Date: 2015-03-24 18:44:54
195Mathematics / Logic in computer science / Maude system / Computability theory / Abstraction / Rewriting / Predicate / Philosophy / Normal form / Theoretical computer science / Formal languages / Programming language theory

Toward Reflective Application Testing in Open Environments Eyvind W. Axelsen, Einar Broch Johnsen, and Olaf Owe Department of Informatics, University of Oslo Abstract Many distributed applications can be understood in te

Add to Reading List

Source URL: www.nik.no

Language: English - Date: 2004-12-12 14:02:10
196Theory of computation / Computability theory / Alan Turing / Turing machine / Mathematical logic / Computability / Algorithm / Church–Turing thesis / Interactive computation / Theoretical computer science / Computer science / Applied mathematics

International Conference on History and Philosophy of Computing (HAPOC) The International Conference on History and Philosophy of Computing[removed]November, Ghent University, Belgium), collected for the first time in a si

Add to Reading List

Source URL: logica.ugent.be

Language: English - Date: 2012-01-04 08:41:21
197Computability theory / Lambda calculus / Computer science / Logic in computer science / Models of computation / Theoretical computer science / Applied mathematics

HOOTS99 Preliminary Version Object Closure Conversion Neal Glew 1 Department of Computer Science Cornell University

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 1999-08-25 13:13:44
198Turing machine / Models of computation / Computability theory / Alan Turing / Register machine / Computability / Computer / Logic / Computable number / Theoretical computer science / Theory of computation / Computer science

A short history of small machines Liesbeth De Mol1? and Maarten Bullynck2 1 Center for Logic and Philosophy of Science, University of Ghent, Blandijnberg 2, 9000 Gent, Belgium

Add to Reading List

Source URL: logica.ugent.be

Language: English - Date: 2012-01-31 05:13:11
199Logic / Mathematical logic / First-order logic / Model theory / Predicate logic / Symbol / Computability / Finite-state machine / Linear temporal logic / Automata theory / Models of computation / Theoretical computer science

A Type System for Expressive Security Policies∗ David Walker Cornell University Strong type systems such as those of Java or ML provide provable guarantees about the run-time behaviour of programs. If we type check pro

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 1999-11-02 01:07:11
200Model theory / Proof theory / Metalogic / Logic in computer science / Computability theory / Presburger arithmetic / Quantifier elimination / Decidability / Jan Łukasiewicz / Mathematical logic / Logic / Mathematics

@TechReport{Stansifer:1884:PAIA, author="Ryan Stansifer", title= "Presburger’s Article on Integer Airthmetic: Remarks and Translation", number="TR84-639", institution="Cornell University, Computer Science Department",

Add to Reading List

Source URL: cs.fit.edu

Language: English - Date: 2007-01-22 14:30:32
UPDATE